Events from temporal logic to regular languages with branching
نویسنده
چکیده
Events in natural language semantics, conceived as strings of observations, are extracted from formulas of linear temporal logic, and collected in regular languages. Infinite strings of sets of atomic formulas (fully specifying truth) are truncated and partialized, in line with the bounded temporal extent and descriptive content of events. Branching from that line, counterfactual events are analyzed as b(ranching)-strings accepted by finite b-automata. These structures are compared and contrasted to those of Computational Tree Logic.
منابع مشابه
Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملThe Regular Real-Time Languages
A speciication formalism for reactive systems deenes a class of !-languages. We call a speciication formalism fully decidable if it is constructively closed under boolean operations and has a decidable satissability (nonemptiness) problem. There are two important, robust classes of !-languages that are deenable by fully decidable formalisms. The !-regular languages are deenable by nite automata...
متن کاملDecidable Properties of Tree Languages
The first part of the thesis concerns problems related to the question: " when can a regular tree language be defined in first-order logic? " Characterizations in terms of automata of first-order logic and the related chain logic are presented. A decidable property of tree automata called confusion is introduced; it is conjectured that a regular tree language can be defined in chain logic if an...
متن کاملSpecification Languages for Stutter-Invariant Regular Properties
We present specification languages that naturally capture exactly the regular and ω-regular properties that are stutter invariant. Our specification languages are variants of the classical regular expressions and of the core of PSL, a temporal logic, which is widely used in industry and which extends the classical linear-time temporal logic LTL by semi-extended regular expressions.
متن کاملAn Algorithmic Approach for Checking Closure Properties of !-Regular Languages
In concurrency theory, there are several examples where the interleaved model of concurrency can distinguish between execution sequences which are not signiicantly diierent. One such example is sequences that diier from each other by stuttering, i. e., the number of times a state can adjacently repeat. Another example is executions that diier only by the ordering of independently executed event...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009